bv2epr: A Tool for Polynomially Translating Quantifier-free Bit-Vector Formulas into EPR∗
نویسندگان
چکیده
Bit-precise reasoning is essential in many applications of Satisfiability Modulo Theories (SMT). In recent years, efficient approaches for solving fixed-size bit-vector formulas have been developed. Most of these approaches rely on bit-blasting. In [1], we argued that bit-blasting is not polynomial in general, and then showed that solving quantifier-free bit-vector formulas (QF BV) is NExpTime-complete. In this paper, we present a tool based on a new polynomial translation from QF BV into Effectively Propositional Logic (EPR). This allows us to solve QF BV problems using EPR solvers and avoids the exponential growth that comes with bit-blasting. Additionally, our tool allows us to easily generate new challenging benchmarks for EPR solvers.
منابع مشابه
Theoretical and Practical Aspects of Bit-Vector Reasoning
Satisfiability Modulo Theories (SMT) is a broad field of research and an important topic for many practical applications. In this thesis, we focus on theories of bitvectors as used, e.g., in hardware and software verification, but also in many other areas. In particular, we discuss satisfiability of bit-vector logics and related problems. The satisfiability problem of propositional formulas (SA...
متن کاملMore on the Complexity of Quantifier-Free Fixed-Size Bit-Vector Logics with Binary Encoding
Bit-precise reasoning is important for many practical applications of Satisfiability Modulo Theories (SMT). In recent years, efficient approaches for solving fixed-size bit-vector formulas have been developed. From the theoretical point of view, only few results on the complexity of fixed-size bit-vector logics have been published. Most of these results only hold if unary encoding on the bit-wi...
متن کاملBounding Quantification in Parametric Expansions of Presburger Arithmetic
Generalizing Cooper’s method of quantifier elimination for Presburger arithmetic, we give a new proof that all parametric Presburger families {St : t ∈ N} (as defined by Woods in [8]) are definable by formulas with polynomially bounded quantifiers in an expanded language with predicates for divisibility by f(t) for every polynomial f ∈ Z[t]. In fact, this quantifier bounding method works more g...
متن کاملDeciding quantifier-free Presburger formulas using finite instantiation based on parameterized solution bounds
Given a formula Φ in quantifier-free Presburger arithmetic, it is well known that, if there is a satisfying solution to Φ, there is one whose size, measured in bits, is polynomially bounded in the size of Φ. In this paper, we consider a special class of quantifier-free Presburger formulas in which most linear constraints are separation (difference-bound) constraints, and the non-separation cons...
متن کاملBit-Precise Reasoning Beyond Bit-Blasting
In the field of hardware and software verification, many applications require to determine satisfiability of first-order-logic with respect to one or more background theories, also referred to as Satisfiability Modulo Theories (SMT). The majority of these applications relies on bit-precise reasoning as provided by SMT solvers for the quantifier-free theory of fixed-size bit-vectors, often combi...
متن کامل